Edge method for on-orbit defocus assessment

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge Width Estimation for Defocus Map from a Single Image

The paper presents a new edge width estimation method based on Gaussian edge model and unsharp mask analysis. The proposed method is accurate and robust to noise. Its effectiveness is demonstrated by its application for the problem of defocus map estimation from a single image. Sparse defocus map is constructed using edge detection algorithm followed by the proposed edge width estimation algori...

متن کامل

Quality Assessment Based Coded Apertures for Defocus Deblurring

A conventional camera with small size pixels may capture images with defocused blurred regions. Blurring, as a lowpass filter, attenuates or drops details of the captured image. This fact makes deblurring as an ill-posed problem. Coded aperture photography can decrease destructive effects of blurring in defocused images. Hence, in this case, aperture patterns are designed or evaluated based on ...

متن کامل

diagnostic and developmental potentials of dynamic assessment for writing skill

این پایان نامه بدنبال بررسی کاربرد ارزیابی مستمر در یک محیط یادگیری زبان دوم از طریق طرح چهار سوال تحقیق زیر بود: (1) درک توانایی های فراگیران زمانیکه که از طریق برآورد عملکرد مستقل آنها امکان پذیر نباشد اما در طول جلسات ارزیابی مستمر مشخص شوند; (2) امکان تقویت توانایی های فراگیران از طریق ارزیابی مستمر; (3) سودمندی ارزیابی مستمر در هدایت آموزش فردی به سمتی که به منطقه ی تقریبی رشد افراد حساس ا...

15 صفحه اول

Sufficient conditions for maximally edge-connected and super-edge-connected

Let $G$ be a connected graph with minimum degree $delta$ and edge-connectivity $lambda$. A graph ismaximally edge-connected if $lambda=delta$, and it is super-edge-connected if every minimum edge-cut istrivial; that is, if every minimum edge-cut consists of edges incident with a vertex of minimum degree.In this paper, we show that a connected graph or a connected triangle-free graph is maximall...

متن کامل

The Orbit Method for the Jacobi Group

g∗ −→ g, λ 7→ Xλ characterized by λ(Y ) =< Xλ, Y >, Y ∈ g. Therefore the coadjoint G-orbits in g∗ may be identified with adjoint G-orbits in g. The philosophy of the orbit method says that we may attach the irreducible unitary representations of G to the coadjoint orbits in g∗. Historically the orbit method that was first initiated by A.A. Kirillov (cf. [K]) early in the 1960s in a real nilpote...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Optics Express

سال: 2010

ISSN: 1094-4087

DOI: 10.1364/oe.18.020845